Deciding on the total number of product architectures
نویسندگان
چکیده
منابع مشابه
Total Domination Number of Cartesian Product Networks
Let denote the Cartesian product of graphs and A total dominating set of with no isolated vertex is a set of vertices of such that every vertex is adjacent to a vertex in The total domination number of is the minimum cardinality of a total dominating set. In this paper, we give a new lower bound of total domination number of using parameters total domination, packing and -domination numbers of ...
متن کاملsurvey on the rule of the due & hindering relying on the sheikh ansaris ideas
قاعده مقتضی و مانع در متون فقهی کم و بیش مستند احکام قرار گرفته و مورد مناقشه فقهاء و اصولیین می باشد و مشهور معتقند مقتضی و مانع، قاعده نیست بلکه یکی از مسائل ذیل استصحاب است لذا نگارنده بر آن شد تا پیرامون این قاعده پژوهش جامعی انجام دهد. به عقیده ما مقتضی دارای حیثیت مستقلی است و هر گاه می گوییم مقتضی احراز شد یعنی با ماهیت مستقل خودش محرز گشته و قطعا اقتضاء خود را خواهد داشت مانند نکاح که ...
15 صفحه اولthe effect of taftan pozzolan on the compressive strength of concrete in the environmental conditions of oman sea (chabahar port)
cement is an essential ingredient in the concrete buildings. for production of cement considerable amount of fossil fuel and electrical energy is consumed. on the other hand for generating one tone of portland cement, nearly one ton of carbon dioxide is released. it shows that 7 percent of the total released carbon dioxide in the world relates to the cement industry. considering ecological issu...
the impact of morphological awareness on the vocabulary development of the iranian efl students
this study investigated the impact of explicit instruction of morphemic analysis and synthesis on the vocabulary development of the students. the participants were 90 junior high school students divided into two experimental groups and one control group. morphological awareness techniques (analysis/synthesis) and conventional techniques were used to teach vocabulary in the experimental groups a...
15 صفحه اولLower bounds on the signed (total) $k$-domination number
Let $G$ be a graph with vertex set $V(G)$. For any integer $kge 1$, a signed (total) $k$-dominating functionis a function $f: V(G) rightarrow { -1, 1}$ satisfying $sum_{xin N[v]}f(x)ge k$ ($sum_{xin N(v)}f(x)ge k$)for every $vin V(G)$, where $N(v)$ is the neighborhood of $v$ and $N[v]=N(v)cup{v}$. The minimum of the values$sum_{vin V(G)}f(v)$, taken over all signed (total) $k$-dominating functi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Concurrent Engineering
سال: 2019
ISSN: 1063-293X,1531-2003
DOI: 10.1177/1063293x19888968